The implementation of the parallel shortest vector enumerate in the block Korkin-Zolotarev method

نویسنده

  • V. S. Usatyuk
چکیده

This article present a parallel CPU implementation of Kannan algorithm for solving shortest vector problem in Block Korkin-Zolotarev lattice reduction method. Implementation based on Native POSIX Thread Library and show linear decrease of runtime from number of threads.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Upper and lower bound on the cardinality containing shortest vectors in a lattice reduced by block Korkin-Zolotarev method (Russian)

This article present a concise estimate of upper and lower bound on the cardinality containing shortest vector in a lattice reduced by block Korkin-Zolotarev method (BKZ) for different value of the block size. Paper show how density affect to this cardinality, in form of the ratio of shortest vector size and sucessive minimal. Moreover we give upper estimate of cardinality for critical and Gold...

متن کامل

Block Korkin-Zolotarev algorithm generalization and their practical implementation. (Russian)

We propose a practical algorithm for block Korkin-Zolotarev reduction, a concept introduced by Schnorr, using CPU arbitrary length Householder QR-decomposition for orthogonalization and double precision OpenCL GPU Finke-Post shortest vector enumeration. Empirical tests was used on random lattices in the sense of Goldstein and Mayer.

متن کامل

Application of lattice reduction block Korkin-Zolotarev method to MIMO-decoding

This article present a application of Block Korkin---Zolotarev lattice reduction method for Lattice Reduction---Aided decoding under MIMO---channel. We give a upper bound estimate on the lattice reduced by block Korkin---Zolotarev method (BKZ) for different value of the block size and detecting by SIC.

متن کامل

Block Korkin{zolotarev Bases and Successive Minima

Let b 1 : : : b m 2 IR n be an arbitrary basis of lattice L that is a block Korkin{Zolotarev basis with block s i z e and let i (L) denote the successive minima of lattice L. and we present b l o c k Korkin{Zolotarev lattice bases for which this bound is tight. We i m p r o ve the Nearest Plane Algorithm of Babai (1986) using block Korkin{Zolotarev bases. Given a block Korkin{Zolotarev basis b ...

متن کامل

Computing the minimum distance of nonbinary LDPC codes using block Korkin-Zolotarev method

In article present measure code distance algorithm of binary and ternary linear block code using block Korkin-Zolotarev (BKZ). Proved the upper bound on scaling constant for measure code distance of non-systematic linear block code using BKZ-method for different value of the block size. Introduced method show linear decrease of runtime from number of threads and work especially good under not d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1304.1900  شماره 

صفحات  -

تاریخ انتشار 2013